How Bad Are Wrong Suspicions? Towards Adaptive Distributed Protocols
نویسندگان
چکیده
In this paper, we analyze the performance of consensus protocols based on the rotating coordinator paradigm. We consider a simulated production environment, on which processing and communication resources available for the different processes running the protocols are not necessarily the same. Firstly, we show that, in some scenarios, the performance of the consensus protocol is enhanced when there is an increase in the number and duration of the wrong suspicions periods of the failure detection service used. Since it is well known that wrong suspicions may also decrease the performance of the consensus protocol, a new dilemma is posed to the designers of such protocols. We then propose a new approach to address performance issues in the design of crash-detection based distributed protocols for asynchronous systems. We argue that they must be designed to adapt themselves to the variations on the availability of resources. The concept of slowness oracles is proposed to achieve this goal. Finally, we present a slowness oracle that can be used to transform a non-adaptive consensus protocol into an adaptive one. Simulations show that the adaptive protocol outperforms its conventional non-adaptive counterpart in a number of scenarios, having an equivalent performance in the other scenarios.
منابع مشابه
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done to analyze their performance. This paper represents a starting point for such studies, by focusing on the consensus problem, a problem related to most other agreement problems. The paper analyzes the latency of a conse...
متن کاملPerformance Comparison Between the Paxos and Chandra-Toueg Consensus Algorithms
Protocols which solve agreement problems are essential building blocks for fault tolerant distributed applications. While many protocols have been published, little has been done to analyze their performance. This paper represents a starting point for such studies, by focusing on the consensus problem, a problem related to most other agreement problems. The paper compares the latency of two con...
متن کاملHow to define ‘Moral Realism’
Moral realism is the doctrine that some propositions asserting that some action is ‘morally’ good (obligatory, bad, or wrong) are true. This paper examines three different definitions of what it is for an action to be ‘morally’ good (with corresponding definitions for ‘morally’ obligatory, bad, or wrong) which would make moral realism a clear and plausible view. The first defines ‘morally good ...
متن کاملHow to Solve the Problem of Bad Performance of Cooperative Protocols at Low SNR
We propose some new adaptive amplify-and-forward (AF) and decode-and-forward (DF) protocols using a selection. The new selection criterion is a function of the instantaneous capacities of all possible transmission schemes (with or without cooperation). Outage probabilities and simulation results show that the adaptive cooperation protocols solve the problem of bad performance of cooperation pro...
متن کاملMathematical Analysis of Optimal Tracking Interval Management for Power Efficient Target Tracking Wireless Sensor Networks
In this paper, we study the problem of power efficient tracking interval management for distributed target tracking wireless sensor networks (WSNs). We first analyze the performance of a distributed target tracking network with one moving object, using a quantitative mathematical analysis. We show that previously proposed algorithms are efficient only for constant average velocity objects howev...
متن کامل